Translating HOL to Dedukti
نویسندگان
چکیده
Dedukti is a logical framework based on the λΠ-calculus modulo rewriting, which extends the λΠcalculus with rewrite rules. In this paper, we show how to translate the proofs of a family of HOL proof assistants to Dedukti. The translation preserves binding, typing, and reduction. We implemented this translation in an automated tool and used it to successfully translate the OpenTheory standard library.
منابع مشابه
Mixing HOL and Coq in Dedukti (Extended Abstract)
We use Dedukti as a logical framework for interoperability. We use automated tools to translate different developments made in HOL and in Coq to Dedukti, and we combine them to prove new results. We illustrate our approach with a concrete example where we instantiate a sorting algorithm written in Coq with the natural numbers of HOL.
متن کاملDedukti: a Logical Framework based on the λΠ-Calculus Modulo Theory
Dedukti is a Logical Framework based on the λΠ-Calculus Modulo Theory. We show that many theories can be expressed in Dedukti: constructive and classical predicate logic, Simple type theory, programming languages, Pure type systems, the Calculus of inductive constructions with universes, etc. and that permits to used it to check large libraries of proofs developed in other proof systems: Zenon,...
متن کاملFoCaLiZe and Dedukti to the Rescue for Proof Interoperability
Numerous contributions have been made for some years to allow users to exchange formal proofs between different provers. The main propositions consist in ad hoc pointwise translations, e.g. between HOL Light and Isabelle in the Flyspeck project or uses of more or less complete certificates. We propose in this paper a methodology to combine proofs coming from different theorem provers. This meth...
متن کاملDevelopment of a termination checker for Dedukti
Dedukti [12] is a formal proof checker based on a logical framework called the λΠ-calculus modulo, which is an extension of the simply-typed lambdacalculus with dependent types (e.g. lists of size n) and an equivalence relation on types generated by user-defined rewrite rules (like in Agda or Haskell). Proofs generated by some automated theorem provers (e.g. Zenon, iProver) or proof assistants ...
متن کاملTermination checking in Dedukti
Dedukti is a formal proof checker based on a logical framework called the λΠ-calculus modulo, which is an extension of the simply-typed lambda-calculus with dependent types (e.g. vectors, matrices) and an equivalence relation on types generated by the user-defined rewrite rules. Proofs generated by some automated theorem provers (e.g. Zenon, iProver) or proof assistants (e.g. HOL, Coq, Matita) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015